Note—On “A New Look at Production Switching Heuristics for the Aggregate Planning Problem”
نویسندگان
چکیده
منابع مشابه
Solving a generalized aggregate production planning problem by genetic algorithms
This paper presents a genetic algorithm (GA) for solving a generalized model of single-item resource-constrained aggregate production planning (APP) with linear cost functions. APP belongs to a class of pro-duction planning problems in which there is a single production variable representing the total production of all products. We linearize a linear mixed-integer model of APP subject to hiring...
متن کاملA new Approach Versus Benders Decomposition in Aggregate Production Planning
This paper proposes a simplified solution procedure to the model presented by Akinc and Roodman. The Benders’ decomposition procedure for analyzing this model has been developed, and its shortcomings have been highlighted. Here, the special nature of the problem is exploited which allowed us to develop a new algorithm through surrogating method. The two methods are compared by several numerical...
متن کاملA mixed integer linear programming formulation for a multi-stage, multi-Product, multi-vehicle aggregate production-distribution planning problem
In today’s competitive market place, companies seek an efficient structure of supply chain so as to provide customers with highest value and achieve competitive advantage. This requires a broader perspective than just the borders of an individual company during a supply chain. This paper investigates an aggregate production planning problem integrated with distribution issues in a supply chain ...
متن کاملsolving a generalized aggregate production planning problem by genetic algorithms
this paper presents a genetic algorithm (ga) for solving a generalized model of single-item resource-constrained aggregate production planning (app) with linear cost functions. app belongs to a class of pro-duction planning problems in which there is a single production variable representing the total production of all products. we linearize a linear mixed-integer model of app subject to hiring...
متن کاملOne Heuristics for Production Planning Problem with Sequence Dependent Setups
Each of n items (products) is to be processed on two, capacity limited machines in order to satisfy known demands in each of T periods. Only one item can be processed on each machine at any given time and period. Each switch from one item to another requires sequence dependent setup time. The object is to minimize the sum of the costs of production, storage and setup. We define a quadratic mixe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Management Science
سال: 1980
ISSN: 0025-1909,1526-5501
DOI: 10.1287/mnsc.26.11.1185